Conservative Extension in HOL

نویسنده

  • Roger Bishop Jones
چکیده

This note offers an alternative to a proposal by Rob Arthan for a simpler and more powerful replacement for the mechanisms currently provided in the various HOL implementation for defining new constants.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpretation of the Deductive Tableau in HOL

Our research investigates frameworks supporting the formalization of programming calculi and their application to deduction-based program synthesis. Here we report on a case study: within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development which can simulate those of the deductive tableau proposed by Manna and Waldinger. We...

متن کامل

Semi-automatic Proofs about Object Graphs in Separation Logic

Published correctness proofs of garbage collectors in separation logic to date depend on extensive manual, interactive formula manipulations. This paper shows that the approach of symbolic execution in separation logic, as first developed by Smallfoot, also encompasses reasoning about object graphs given by the reachability of objects. This approach yields semi-automatic proofs of two central g...

متن کامل

The Hol Logic Extended with Quantiication over Type Variables

The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantiication over types. It is shown how certain practical problems with using the deenitional mechanisms of HOL would be solved by the additional expressive power g...

متن کامل

The HOL Logic Extended with Quantification over Type Variables

The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantification over types. It is shown how certain practical problems with using the definitional mechanisms of HOL would be solved by the additional expressive power...

متن کامل

Formal System Verification - Extension

Specification Executable Specification High-Performance C Implementation Haskell Prototype Isabelle/HOL Automatic Translation

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012